Unfold/Fold Transformations of CCP Programs
نویسندگان
چکیده
We introduce a transformation system for concurrent constraint programming (CCP). We deene suitable applicability conditions for the transformations which guarantee that the input/output ccp semantics is preserved also when distinguishing deadlocked computations from successful ones. The systems allows to optimize CCP programs while preserving their intended meaning. Furthermore, since it preserves the deadlock behaviour of programs, it can be used for proving deadlock freeness of a class of queries in a given program.
منابع مشابه
Induction Proofs by Program Transformations
Unfold/fold transformations have been studied for various declarative programming languages such as functional languages [5, 12, 21], logic programming [14, 22, 23] and constraint logic programming [1, 8, 13]. Some of the most extensively studied transformation systems for logic programs are the unfold/fold transformation systems. At a high level, unfold and fold transformations for definite lo...
متن کاملBeyond Tamaki-Sato Style Unfold/Fold Transformations for Normal Logic Programs
Unfold/fold transformation systems for logic programs have been extensively investigated. Existing unfold/fold transformation systems for normal logic programs typically fold using using a single, non-recursive clause i.e. the folding transformation is very restricted. In this paper we present a transformation system that permits folding in the presence of recursion, disjunction, as well as neg...
متن کاملUnfold/fold Transformations of Concurrent Processes 1
Program transformation is a technique for obtaining, starting from a program P, a semantically equivalent one, which is "better" than P with respect to a particular goal. Traditionally, the main goal of program transformation was obtaining more eecient programs, but, in general, this technique can be used to produce programs written in a syntactic form satisfying some properties. Program transf...
متن کاملA Parameterized Unfold/Fold Transformation Framework for De nite Logic Programs
Given a program P , an unfold/fold program transformation system derives a sequence of programs P = P0, P1, : : : , Pn, such that Pi+1 is derived from Pi by application of either an unfolding or a folding step. Existing unfold/fold transformation systems for de nite logic programs di er from one another mainly in the kind of folding transformations they permit at each step. Some allow folding u...
متن کاملTransformationFramework for De nite Logic Programs ?
Given a program P , an unfold/fold program transformation system derives a sequence of programs P = P0 , P1 , : : : , Pn , such that Pi+1 is derived from Pi by application of either an unfolding or a folding step. Existing unfold/fold transformation systems for deenite logic programs diier from one another mainly in the kind of folding transformations they permit at each step. Some allow foldin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998